Programming errors in traversal programs over structured data
نویسندگان
چکیده
منابع مشابه
Programming errors in traversal programs over structured data
Traversal strategies à la Stratego (also à la Strafunski and ‘Scrap Your Boilerplate’) provide an exceptionally versatile and uniform means of querying and transforming deeply nested and heterogeneously structured data including terms in functional programming and rewriting, objects in OO programming, and XML documents in XML programming. However, the resulting traversal programs are prone to p...
متن کاملHiding Traversal of Tree Structured Data from Untrusted Data Stores
With the increasing use of web services, many new challenges concerning data security are becoming critical. Especially in mobile services, where clients are generally thin in terms of computation power and storage space, a remote server can be outsourced for the computation or can act as a data store. Unfortunately, such a data store may not always be trustworthy and clients with sensitive dat...
متن کاملAnalyzing Concurrent Programs for Potential Programming Errors
........................................................................................................................................................ 4
متن کاملGraph Traversal and Linear Programs
Besides breadth first search, which we saw in class in relation to Dijkstra’s algorithm, there is one other fundamental algorithm for searching a graph: depth first search. To better understand the need for these procedures, let us imagine the computer’s view of a graph that has been input into it, in the adjacency list representation. The computer’s view is fundamentally local to a specific ve...
متن کاملGraph Traversal and Linear Programs
Besides breadth first search, which we saw in class in relation to Dijkstra’s algorithm, there is one other fundamental algorithm for searching a graph: depth first search. To better understand the need for these procedures, let us imagine the computer’s view of a graph that has been input into it, in the adjacency list representation. The computer’s view is fundamentally local to a specific ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2013
ISSN: 0167-6423
DOI: 10.1016/j.scico.2011.11.006